Improved parallel construction of wavelet trees and rank/select structures
نویسندگان
چکیده
منابع مشابه
Online Construction of Wavelet Trees
The wavelet tree (WT) is a flexible and efficient data structure for representing character strings in succinct space, while allowing for fast generalised rank, select and access operations. As such, they play an important role in modern text indexing methods. However, despite their popularity, not many algorithms have been published concerning their construction. In particular, while the WT is...
متن کاملParallel Construction of Succinct Trees
Succinct representations of trees are an elegant solution to make large trees fit in main memory while still supporting navigational operations in constant time. However, their construction time remains a bottleneck. We introduce a practical parallel algorithm that improves the state of the art in succinct tree construction. Given a tree on n nodes stored as a sequence of balanced parentheses, ...
متن کاملParallel Construction and Searches of Digital Trees
Geometric searching is an element of mesh generation, interpolation, visualization, collision detection, and many other tasks. The task is searching a cloud of points for the nearest point to a target or all cloud points within a specified distance from a target. This is inherently a O(N) search problem for each query if all N cloud points points are interrogated. Fortunately, this complexity c...
متن کاملParallel Log-time Construction of Suffix Trees
Many string matching applications are based on suffix trees. Linear time sequential algorithms are available for constructing such trees. A CReW Parnllel RAM algorithm is presented here which takes 0 (logn) time with n processors, n being the length of the input string. The algorithm requires ern2) space, but only 0 (n iogn) cells need to be initialized.
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2020
ISSN: 0890-5401
DOI: 10.1016/j.ic.2020.104516